cient Lossless Compression of Trees and Graphs
نویسندگان
چکیده
In this paper, we study the problem of compressing a data structure (e.g. tree, undirected and directed graphs) in an eecient way while keeping a similar structure in the compressed form. To date, there has been no proven optimal algorithm for this problem. We use the idea of building LZW tree in LZW compression to compress a binary tree generated by a stationary ergodic source in an optimal manner. We also extend our tree compression algorithm to compress undirected and directed acyclic graphs.
منابع مشابه
Lossless Microarray Image Compression by Hardware Array Compactor
Microarray technology is a new and powerful tool for concurrent monitoring of large number of genes expressions. Each microarray experiment produces hundreds of images. Each digital image requires a large storage space. Hence, real-time processing of these images and transmission of them necessitates efficient and custom-made lossless compression schemes. In this paper, we offer a new archi...
متن کاملFast Algorithm for Optimal Compression of Graphs
We consider the problem of finding optimal description for general unlabeled graphs. Given a probability distribution on labeled graphs, we introduced in [4] a structural entropy as a lower bound for the lossless compression of such graphs. Specifically, we proved that the structural entropy for the Erdős–Rényi random graph, in which edges are added with probability p, is ` n 2 ́ h(p)−n log n+O(...
متن کاملA Scalable to Lossless Audio Compression Scheme
This paper outlines a scalable to lossless coder, that is the coder presented is a scalable coder that scales from lossy quality to lossless quality. Lossless compression is achieved by concatenating a lossy, scalable transform coder with a scalable scheme for the compression of the synthesis error signal. The lossless compression results obtained are comparable with the state of the art in los...
متن کاملLossless Compression of Volumetric Medical Images with Improved 3-D SPIHT Algorithm
This paper presents a lossless compression of volumetric medical images with the improved 3-D SPIHT algorithm that searches on asymmetric trees. The tree structure links wavelet coefficients produced by three-dimensional reversible integer wavelet transforms. Experiments show that the lossless compression with the improved 3-D SPIHT gives improvement about 42% on average over two-dimensional te...
متن کاملScalable to lossless audio compression based on perceptual set partitioning in hierarchical trees (PSPIHT)
This paper proposes a technique for scalable and also provides for lossless compression. It reduces smooth objective scalability, in terms of SegSNR, from lossy to lossless compression. The proposal is built around the perceptual SPIHT algorithm, which is a modification of the SPIHT algorithm and is introduced in this paper. Both objective and subjective results are reported and demonstrate tha...
متن کامل